//
// Created by zuo on 2024/6/29.
// 题目链接 https://www.lanqiao.cn/problems/1389/learning/?page=1&first_category_id=1&problem_id=1389
//

#include<iostream>
#include<algorithm>

using namespace std;

int main()
{
    int data[200];
    int num;
    cin >> num;
    for (int i = 0; i < 200; i++) data[i] = 4 * i + 6;
    // 先排序  非降序
    sort(data, data + 200);
    // 后查找
    int start_pos = lower_bound(data, data + 200, num) - data;
    int end_pos = upper_bound(data, data + 200, num) - data;
    // [start_pos,end_pos)
    for (int i = start_pos; i < end_pos; i++)
    {
        cout << i << ' ';
    }

    return 0;
}
